A revised completeness result for the simply typed λμ-calculus using realizability semantics
نویسندگان
چکیده
In this paper, we define a new realizability semantics for the simply typed λμ-calculus. We show that if a term is typable, then it inhabits the interpretation of its type. We also prove a completeness result of our realizability semantics using a particular term model. This paper corrects some errors in [21] by the first author and Saber.
منابع مشابه
ar X iv : 0 90 5 . 03 57 v 1 [ m at h . L O ] 4 M ay 2 00 9 A completeness result for the simply typed λ μ - calculus
In this paper, we define a realizability semantics for the simply typed λµ-calculus. We show that if a term is typable, then it inhabits the interpretation of its type. This result serves to give characterizations of the computational behavior of some closed typed terms. We also prove a completeness result of our realizability semantics using a particular term model.
متن کاملA completeness result for the simply typed -calculus
In this paper, we define a semantic of realizability for the simply typed λμcalculus. An adequation lemma is proved, it allows to give characterizations of the computational behavior of some closed typed terms through their types. We dealt also with the problem of completeness and prove a completeness result.
متن کاملLinear realizability and full completeness for typed lambda-calculi
We present the model construction technique called Linear Realizability. It consists in building a category of Partial Equivalence Relations over a Linear Combinatory Algebra. We illustrate how it can be used to provide models, which are fully complete for various typed λ-calculi. In particular, we focus on special Linear Combinatory Algebras of partial involutions, and we present PER models ov...
متن کاملCompleteness Results for Higher - Order Equational Logic submitted
We present several results concerning deductive completeness of the simply typed λcalculus with constants and equational axioms. First, we prove deductive completeness of the calculus with respect to standard semantics for axioms containing neither free nor bound occurrences of higher-order variables. Using this result, we analyze some fundamental deductive and semantic properties of axiomatic ...
متن کاملA short proof of the strong normalization of the simply typed λμ-calculus
We give an elementary and purely arithmetical proof of the strong normalization of Parigot’s simply typed λμ-calculus.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Logical Methods in Computer Science
دوره 13 شماره
صفحات -
تاریخ انتشار 2017